Arbitrary function approximation in HDLs with application to the N-body problem
نویسندگان
چکیده
A module generator is described that allows for the generation of synthesizable VHDL modules which implement arbitrary functions in fixed point precision using the Symmetric Table Addition Method (STAM). This module generator was interfaced to a high level synthesis tool “fly” which automatically generates fully-pipelined circuits from a Perl-like language. The resulting system was applied to the N-body problem and results are presented. It was found that a function generator module is a very useful addition to a hardware description language.
منابع مشابه
APPLICATION OF THE SINC APPROXIMATION TO THE SOLUTION OF BRATU'S PROBLEM
In this work, we study the performance of the sinc-Collocation method for solving Bratu's problem. For different choices of step size, we consider the maximum absolute errors in the solutions at sinc grid points and tabulated in tables. The comparison of the obtained results veri ed that this method converges to the exact solution rapidly and with
متن کاملUniversal Approximation of Interval-valued Fuzzy Systems Based on Interval-valued Implications
It is firstly proved that the multi-input-single-output (MISO) fuzzy systems based on interval-valued $R$- and $S$-implications can approximate any continuous function defined on a compact set to arbitrary accuracy. A formula to compute the lower upper bounds on the number of interval-valued fuzzy sets needed to achieve a pre-specified approximation accuracy for an arbitrary multivariate con...
متن کاملOptimization of the Inflationary Inventory Control Model under Stochastic Conditions with Simpson Approximation: Particle Swarm Optimization Approach
In this study, we considered an inflationary inventory control model under non-deterministic conditions. We assumed the inflation rate as a normal distribution, with any arbitrary probability density function (pdf). The objective function was to minimize the total discount cost of the inventory system. We used two methods to solve this problem. One was the classic numerical approach which turne...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملA general approach to linguistic approximation and its application in frame of fuzzy logic deduction
This paper deals with one problem that needs to be addressed in the emerging field known under the name computing with perceptions. It is the problem of describing, approximately, a given fuzzy set in natural language. This problem has lately been referred to as the problem of retranslation. An approaches to dealing with the retranslation problem is discussed in the paper, that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003